First-order Multi-Modal Deduction1

نویسنده

  • Matthew Stone
چکیده

We study prefixed tableaux for first-order multi-modal logic, providing proofs for soundness and completeness theorems, a Herbrand theorem on deductions describing the use of Herbrand or Skolem terms in place of parameters in proofs, and a lifting theorem describing the use of variables and constraints to describe instantiation. The general development applies uniformly across a range of regimes for defining modal operators and relating them to one another; we also consider certain simplifications that are possible with restricted modal theories and fragments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metareasoning for Multi-agent Epistemic Logics

We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theore...

متن کامل

A Note on Axiomatisations of Two-Dimensional Modal Logics

We analyse the role of the modal axiom corresponding to the first-order formula “∃y (x = y)” in axiomatisations of two-dimensional propositional modal logics. One of the several possible connections between propositional multi-modal logics and classical first-order logic is to consider finite variable fragments of the latter as ‘multi-dimensional’ modal formalisms: First-order variable-assignme...

متن کامل

Multi-Agent Belief Reasoning in a First-Order Logic Back-Chainer Technical Report

This report gives a brief overview of and a few pointers on belief reasoning for multi-agent systems. The modeling of beliefs is usually done in terms of modal logics which are fairly costly to reason in. We introduce our novel, more practical approach to belief reasoning in a first-order back-chaining system such as Prolog. At the end of the report, we justify the approach by relating some of ...

متن کامل

New Architectures, Algorithms and Designs That Lead to Implemented Machine Reasoning over Knowledge in Epistemic and Deontic Formats, in the Service of Advanced Wargaming

We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theore...

متن کامل

Inquisitive bisimulation

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999